Time-Windowed Closest Pair
نویسندگان
چکیده
Given a set of points in any constant dimension, each of which is associated with a time during which that point is active, we design a data structure with O(n log n) space that can find the closest pair of active points within a query interval of time in O(log log n) time using a quadtree-based approach in the word-RAM model.
منابع مشابه
Closest pair queries in spatio-temporal databases
In recent years, spatio-temporal databases have been studied intensively. This paper proposes how to process k closest pair queries in spatio-temporal databases for the first time. A spatio-temporal k closest pair query continuously searches the k closest pairs between a set of spatial objects and a set of moving objects for a specified time interval of the query. To maintain the order of the k...
متن کاملAn Optimal Algorithm for Closest-Pair Maintenance
Given a set S of n points in k-dimensional space, and an L t metric, the dynamic closest pair problem is deened as follows: nd a closest pair of S after each update of S (the insertion or the deletion of a point). For xed dimension k and xed metric L t , we give a data structure of size O(n) that maintains a closest pair of S in O(log n) time per insertion and deletion. The running time of algo...
متن کاملHardness of Approximate Nearest Neighbor Search
We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for every δ > 0 there exists a constant ε > 0 such that computing a (1 + ε)-approximation to the Bichromatic Closest Pair requires Ω (
متن کاملPyramid Computer Solutions of the Closest Pair Problem
Given an N x N array of OS and Is, the closest pair problem is to determine the minimum distance between any pair of ones. Let D be this minimum distance (or D = 2N if there are fewer than two Is). Two solutions to this problem are given, one requiring O(log( N) + D) time and the other O(log( N)). These solutions are for two types of parallel computers arranged in a pyramid fashion with the bas...
متن کاملStochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces
Let T be a tree space (or tree network) represented by a weighted tree with t vertices, and S be a set of n stochastic points in T , each of which has a fixed location with an independent existence probability. We investigate two fundamental problems under such a stochastic setting, the closest-pair problem and the nearest-neighbor search. For the former, we study the computation of the `-thres...
متن کامل